Romano Guardini gilt als einer der massgeblichen christlichen Denker des 20. Jahrhunderts. Seine Schriften, philosophische und theologische Abhandlungen, aber auch zahlreiche meditative und spirituelle Texte, haben eine weltweite Verbreitung gefunden und pragen ungebrochen bis heute Generationen von Leserinnen und Lesern. Der vorliegende Band, der aus Anlass des 50. Todestages Romano Guardinis am 1. Oktober 2018 sowie zur Eroffnung des Seligsprechungsprozesses erscheint, versammelt Beitrage namhafter Autorinnen und Autoren. Aus unterschiedlichen Perspektiven widmen sie sich insbesondere Guardinis Buch "Der Herr" uber Person und (...) Botschaft Jesu Christi, aber beispielsweise auch Aspekten der Gottesfrage, der Ethik oder des Gebets. Eine Fundgrube fur alle, die sich der Person und dem Denken Guardinis neu nahern mochten. Mit Beitragen von Hanna-Barbara Gerl-Falkovitz, Jean Greisch, Karl Kardinal Lehmann (+), Peter Reifenberg, Marius Reiser, Peter Schallenberg, P. Kosmas Lars Thielmann OCist, Karl-Heinz Wiesemann. (shrink)

Auch als originar politischer Denker ist Karl Jaspers reich an Einsichten: Ausgehend vom Ethos der Freiheit jedes Einzelnen richtet er seinen Blick auf die konkrete politische Gestaltung einer Freiheitsordnung. Dabei steht fur ihn im Hinblick auf die noch junge Bundesrepublik die Selbsterziehung in Freiheit im Zentrum seiner oft mahnenden Worte. Ganz im sokratischen Sinne fordert er intellektuelle Redlichkeit und politische Wahrhaftigkeit ein, um den beiden grossen Gegenwartsherausforderungen gewachsen zu sein: einer atomwaffenbestuckten Welt, die sich jederzeit selbst ausloschen kann, und (...) dem modernen Totalitarismus, der in seiner Verherrlichung des Antipolitischen allen politischen Ordnungsbestrebungen die Vernichtung androht. Jeder Frieden, der mehr ist als die Friedhofsruhe eines Waffenstillstands, grundet fur Jaspers in der politischen Freiheit handelnder Burgerinnen und Burger, die gemeinsam Sorge fur die Integritat ihres politischen Gemeinwesens tragen. Mit Beitragen von Karl-Heinz Breier, Alexander Gantschow, Anton Hugli, Annabelle Petschow, Kurt Salamun, Reinhard Schulz, Bernhard Sutor, Bernd Weidmann. (shrink)

‘Progress’ is a dazzling concept used to describe developments in all areas of life. Progress is of particular interest in the sciences, where it manifests itself in innovations in the natural sciences and technology, for example. Whether one trusts in progress and looks hopefully into the future or longs for a golden past and distrusts progress depends on the observer. Modern science cannot be separated from the hope for progress and new knowledge. In this book, examples from different sciences are (...) used to look at progress in those fields. In addition, the scientific environment, in the form of the communication and promotion of science, is also taken into account. With contributions by Prof. Dr. Thomas Heinemann, Prof. Dr. Gregor Maria Hoff, Prof. Dr. Wim Kösters, Prof. Dr. Ulrich Lüke, Prof. Dr. Gregor Nickel, Prof. Dr. Thomas Schmidt, Prof. Dr. Jörg Siekmann, Prof. Dr. Manfred Stöckler and Dr. Eva-Maria Streier. (shrink)

The paper builds on a simply typed term system ${\cal PR}^\omega $ providing a notion of partial primitive recursive functional on arbitrary Scott domains $D_\sigma$ that includes a suitable concept of parallelism. Computability on the partial continuous functionals seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (SCVR) is not reducible to partial primitive recursion. So an extension ${\cal PR}^{\omega e}$ is studied that is closed under SCVR and yet stays within the realm of subrecursiveness. The twist (...) are certain type 1 Gödel recursors ${\cal R}_k$ for simultaneous partial primitive recursion. Formally, the value ${\cal R}_k\vec{g}\vec{H} x i$ is a function $f_i$ of type $\iota \to \iota$ , however, ${\cal R}_k$ is modelled such that $f_i$ is a finite element of $D_{\iota\to\iota}$ or in other words, a partial sequence. It is shown that the Ackermann function is not definable in ${\cal PR}^{\omega e}$. (shrink)

The differentiation of trait anxiety and depression in nonclinical and clinical populations is addressed. Following the tripartite model, it is assumed that anxiety and depression share a large portion of negative affectivity, but differ with respect to bodily hyperarousal and anhedonia. In contrast to the tripartite model, NA is subdivided into worry and dysthymia, which leads to a four-variable model of anxiety and depression encompassing emotionality, worry, dysthymia, and anhedonia. Item-level confirmatory factor analyses and latent class cluster analysis based on (...) a large nation-wide representative German sample substantiate the construct validity of the model. Further evidence concerning convergent and discriminant validity with respect to related constructs is obtained in two smaller nonclinical and clinical samples. Factors influencing the association between components of anxiety and depression are discussed. (shrink)

The paper studies a simply typed term system Mω providing a primitive recursive concept of parallelism in the sense of Plotkin. The system aims at defining and computing partial continuous functionals. Some connections between denotational and operational semantics → for Mω are investigated. It is shown that → is correct with respect to the denotational semantics. Conversely, → is complete in the sense that if a program denotes some number k, then it is reducible to the numeral nk. Restricting to (...) the primitive recursive kernel Rω of Mω, it is shown that → is strongly normalising with uniquely determined normal forms. The twist is the design of fixed point style conversion rules for constants accounting for parallelly bounded parallel search such that correctness and strong normalisation hold. Thereupon, minor alternations to → bring about that every reduction sequence for a program of Rω terminates either in a numeral nk if the program denotes k, or in the term 0 if the program denotes the “undefined” object. Thus, Rω can be considered a primitive recursive version of Plotkin's PA+·. (shrink)

A collaboration has been arranged for the preparation and publication in three dual-language volumes within the Hegel series presently in preparation by Fr. Frommanns Verlag of new critical editions of Hegel’s 1821 Lectures on the Philosophy of Religion, to be included in one volume with the up to now unpublished first form of his Encyclopedia, and Hegel’s 1824 Lectures on the Philosophy of Religion, in two volumes. The new German editions are to be prepared by Professor Dr. K.-H. Ilting. The (...) English translations are to be prepared by Professor Darrel E. Christensen. The anticipation is that the first of these editions will appear some time in 1973. (shrink)

Die Arbeit fragt den Anfangen psychologischer Begriffsbildung nach: In den Bestimmungen der Asthetik um 1800 stellt sich der Gestaltbegriff als Einheit von Form und Inhalt, von Begriff und Natur solchermassen vor, dass erkennendes Subjekt und Erscheinungswelt versohnt scheinen; jene, von Kants -asthetischer Urteilskraft- sich herleitende Illusion erscheint in ihrer asthetisch-naturphilosophischen (Goethe-Schelling-Carus) und psychologisch-asthetischen Version (Reinhold-Fichte-Schiller-Niethammer) in einem jeweils entsprechenden Begriff erzieherisch-vorauszusetzender menschlicher Natur und figuriert in - individuelles Verhalten und die Gesetze der Natur versohnenden- Bildern -subjektiver Totalitat-.".

The paper builds on both a simply typed term system ${\cal PR}^\omega$ and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion of partial primitive recursive functional on Scott domains $D_\rho$ supporting a suitable concept of parallelism. Computability on Scott domains seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (scvr) is not reducible to partial primitive recursion. So extensions ${\cal PR}^{\omega e}$ and PTWP $^e$ are studied that (...) are closed under scvr. The twist are certain type 1 Gödel recursors ${\cal R}_k$ for simultaneous partial primitive recursion. Formally, ${\cal R}_k\vec{g}\vec{H}xi$ denotes a function $f_i \in D_{\iota\to\iota}$ , however, ${\cal R}_k$ is modelled such that $f_i$ is finite, or in other words, a partial sequence. As for PTWP $^e$ , the concept of type $\iota\to\iota$ writable variables is introduced, providing the possibility of creating and manipulating partial sequences. It is shown that the PTWP $^e$ -computable functionals coincide with those definable in ${\cal PR}^{\omega e}$ plus a constant for sequential minimisation. In particular, the functionals definable in ${\cal PR}^{\omega e}$ denoted ${\cal R}^{\omega e}$ can be characterised by a subclass of PTWP $^e$ -computable functionals denoted ${\rm PPR}^{\omega e}$ . Moreover, hierarchies of strictly increasing classes ${\cal R}^{\omega e}_n$ in the style of Heinermann and complexity classes ${\rm PPR}^{\omega e}_n$ are introduced such that $\forall n\ge 0. {\cal R}^{\omega e}_n ={\rm PPR}^{\omega e}_n$ . These results extend those for ${\cal PR}^\omega$ and PTWP [Nig94]. Finally, scvr is employed to define for each type $\sigma$ the enumeration functional $E^\sigma$ of all finite elements of $D_\sigma$. (shrink)

Kann die Kritische Theorie im erziehungswissenschaftlichen und bildungspolitischen Diskurs noch Aktualität beanspruchen? In ihren Beiträgen befassen sich die Autorinnen und Autoren mit einzelnen erziehungs- und bildungstheoretischen Aspekten des aktuellen Diskurses sowie mit pädagogisch relevanten Themen aus dem gesellschaftspolitischen Bereich. Im Fokus steht die Frage, ob die Denkinstrumente der Kritischen Theorie noch zur Analyse von Entwicklungen und zur Aufklärung über Widersprüche im erziehungswissenschaftlichen Diskurs beitragen können.

Two simply typed term systems $\sf {PR}_1$ and $\sf {PR}_2$ are considered, both for representing algorithms computing primitive recursive functions. $\sf {PR}_1$ is based on primitive recursion, $\sf {PR}_2$ on recursion on notation. A purely syntactical method of determining the computational complexity of algorithms in $\sf {PR}_i$ , called $\mu$ -measure, is employed to uniformly integrate traditional results in subrecursion theory with resource-free characterisations of sub-elementary complexity classes. Extending the Schwichtenberg and Müller characterisation of the Grzegorczyk classes ${\mathcal{E}}_n$ for $n\ge (...) 3$ , it is shown $\mathcal{E}_{n+1} = \mathcal{R}^n_1 $ for $ n\ge 1 $, where $ \mathcal{R}^n_i$ denotes the \emph{ $n$ th modified Heinermann class} based on $\mu$ . The proof does not refer to any machine-based computation model, unlike the Schwichtenberg and Müller proofs. This is due to the notion of modified recursion lying on top of each other provided by $\mu$ . By Ritchie's result, $\mathcal{R}^1_1$ characterises the linear-space computable functions. Using the same method, a short and straightforward proof is presented, showing that $\mathcal{R}^1_2$ characterises the polynomial time computable functions. Furthermore, the classes $\mathcal{R}^n_2$ and $\mathcal{R}^n_1$ coincide at and above level 2. (shrink)

A key problem in implicit complexity is to analyse the impact on program run times of nesting control structures, such as recursion in all finite types in functional languages or for-do statements in imperative languages.Three types of programs are studied. One type of program can only use ground type recursion. Another is concerned with imperative programs: ordinary loop programs and stack programs. Programs of the third type can use higher type recursion on notation as in functional programming languages.The present approach (...) to analysing run time yields various characterisations of fptime and all Grzegorczyk classes at and above the flinspace level. Central to this approach is the distinction between “top recursion” and “side recursion”. Top recursions are the only form of recursion which can cause an increase in complexity. Counting the depth of nested top recursions leads to several versions of “the μ-measure”. In this way, various recent solutions of key problems in implicit complexity are integrated into a uniform approach. (shrink)